Priority Algorithms for Graph Optimization Problems
نویسندگان
چکیده
We continue the study of priority or “greedy-like” algorithms as initiated in [6] and as extended to graph theoretic problems in [8]. Graph theoretic problems pose some modelling problems that did not exist in the original applications of [6] and [2]. Following [8], we further clarify these concepts. In the graph theoretic setting there are several natural input formulations for a given problem and we show that priority algorithm bounds in general depend on the input formulation. We study a variety of graph problems in the context of arbitrary and restricted priority models corresponding to known ”greedy algorithms”.
منابع مشابه
The Approximation Power of Priority Algorithms by Spyros Angelopoulos
The Approximation Power of Priority Algorithms Spyros Angelopoulos Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2006 Greedy-like algorithms have been a popular approach in combinatorial optimization, due to their conceptual simplicity and amenability to analysis. Surprisingly, it was only recently that a formal framework for their study emerged. In particul...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملModelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملImproved Results on Models of Greedy and Primal-dual Algorithms
A class of priority algorithms that capture reasonable greedy-like algorithms was introduced by Borodin, Nielson, and Rackoff [7]. Later, Borodin, Cashman, and Magen [4] introduced the stack algorithms, advocating that they capture reasonable primal-dual and local-ratio algorithms. In this thesis, some NP -hard graph optimization problems Maximum Acyclic Subgraph (MAS) problem and Minimum Stein...
متن کامل